The order relation of recursively defined SIL - 1 nodes as part of a denotational semantics Corrie
نویسنده
چکیده
The semantics of the elements of SIL-1 descriptions is a combination of an order relation and a data relation on the access points involved. This semantics is described in the SIL-1 Language Report. To determine the order relation on the access points of recursively defined nodes a formal definition of this semantics is needed. In this paper the order part of a denotational semantics for SIL is presented. It is shown that the order relations of recursive nodes are well defined and uniquely determined by this formal semantics. Moreover it is discussed how the orders of recursive nodes can be derived. The order relation of recursively defined SIL-1 nodes as part of a denotational semantics
منابع مشابه
A Denotational Semantics for SIL-11 as basis for Transformational Design of Digital Systems
Transformational design is a promising design methodology which combines correctness by construction and interactive design. In this design methodology the design steps are behaviour preserving transformations of one design representation into another. The representations used in transformational design need to have formal semantic models in order to prove the correctness, behaviour preserving ...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملFull Abstraction for a Recursively Typed Lambda Calculus with Parallel Conditional
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a restricted form, which we call prime systems. A denotational semantics is defined with this interpretation. We define the syntactical normal form approximati...
متن کاملA co-Induction Principle for Recursively Defined Domains
Pitts, A.M., A co-induction principle for recursively defined domains, This paper establishes a new property of predomains recursively defined using the cartesian product, disjoint union, partial function space and convex powerdomain constructors. We prove that the partial order on such a recursive predomain D is the greatest fixed point of a certain monotone operator associated to D. This prov...
متن کاملA Formal Semantic Model to fit SIL for Transformational Design
SIL (SPRITE Input Language) is a single token signal flow graph representation developed as an intermediate format between specification languages and silicon compilers. This paper presents a part of a formal semantic model for SIL which is nicely intuitive because of the use of tables as mathematical representation of the semantics. Together with this semantic model SIL becomes a useful langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993